\relax 
\@writefile{toc}{\contentsline {section}{\numberline {1}Ejercicio 1}{3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Introducci\'on}{3}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Grafo conexo y con un 'unico ciruito, rotulado con pesos en la aristas}}{3}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Los ejes marcados que verifican ser el matching m'aximo}}{3}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Soluci\'on}{4}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.3}Funci'on recursiva}{5}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.3.1}Explicaci'on}{5}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.3.2}Principio de optimalidad}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.3.3}\textquestiondown {Por qu'e la soluci'on es 'optima?}}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Grafo ciclico de n aristas}}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.4}Pseudoc'odigos}{9}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.4.1}Versi'on recursiva}{9}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces $\ensuremath  {\unhbox \voidb@x \hbox {\sc  matchingMaximoRec}}(pesos:[Nat], long: int)$}}{9}}
\newlabel{alg:matchingMaximoRec}{{1}{9}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces $\ensuremath  {\unhbox \voidb@x \hbox {\sc  matchingMaximoRecAux}}(pesosSubList:[Nat], subLong: int)$}}{9}}
\newlabel{alg:matchingMaximoRecAux}{{2}{9}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.4.2}Versi'on iterativa}{10}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {3}{\ignorespaces $\ensuremath  {\unhbox \voidb@x \hbox {\sc  matchingMaximoIter}}(pesos:[Nat], long: int)$}}{10}}
\newlabel{alg:matchingMaximoIter}{{3}{10}}
\@writefile{loa}{\contentsline {algorithm}{\numberline {4}{\ignorespaces $\ensuremath  {\unhbox \voidb@x \hbox {\sc  matchingMaximoIterAux}}(pesosSubList:[Nat], subLong: int)$}}{10}}
\newlabel{alg:matchingMaximoIterAux}{{4}{10}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {1.4.3}Explicaci'on del Pseudoc'odigo}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.5}Complejidad}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.6}Gr\'aficos}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Cantidad de Operaciones $n$ $\in $ [3, 1000]}}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Cantidad de Operaciones $n$ $\in $ [3, 3000] comparanco con aristas de pesos iguales}}{13}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Cantidad de Operaciones $n$ $\in $ [3, 30] comparando con la funci'on recursiva}}{14}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.7}Conclusi\'on}{14}}
\@setckpt{ej1}{
\setcounter{page}{15}
\setcounter{equation}{0}
\setcounter{enumi}{3}
\setcounter{enumii}{0}
\setcounter{enumiii}{0}
\setcounter{enumiv}{0}
\setcounter{footnote}{0}
\setcounter{mpfootnote}{0}
\setcounter{part}{0}
\setcounter{section}{1}
\setcounter{subsection}{7}
\setcounter{subsubsection}{0}
\setcounter{paragraph}{0}
\setcounter{subparagraph}{0}
\setcounter{figure}{6}
\setcounter{table}{0}
\setcounter{float@type}{8}
\setcounter{algorithm}{4}
\setcounter{ALC@unique}{44}
\setcounter{ALC@line}{25}
\setcounter{ALC@rem}{0}
\setcounter{ALC@depth}{0}
\setcounter{parentequation}{0}
}
